Locally primitive Cayley graphs of dihedral groups
نویسندگان
چکیده
منابع مشابه
On the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملOn locally primitive Cayley graphs of finite simple groups
A graph /is said to be G-locally primitive, where G is a subgroup of automorphisms of /-, if the stabiliser G~ of a vertex a acts primitively on the s e t / ( a ) of vertices of / adjacent to or. For a finite non-abelian simple group L and a Cayiey subset S of L, suppose that L <3 G...<Aut( L ) , and the Cayley graph /= Cay ( L, S) is G-locally primitive. In this paper we prove that L is a simp...
متن کاملLocally Primitive Normal Cayley Graphs of Metacyclic Groups
A complete characterization of locally primitive normal Cayley graphs of metacyclic groups is given. Namely, let Γ = Cay(G,S) be such a graph, where G ∼= Zm.Zn is a metacyclic group and m = p1 1 p r2 2 · · · p rt t such that p1 < p2 < · · · < pt. It is proved that G ∼= D2m is a dihedral group, and val(Γ ) = p is a prime such that p|(p1(p1 − 1), p2 − 1, . . . , pt − 1). Moreover, three types of ...
متن کاملDiameter 2 Cayley graphs of dihedral groups
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree d. We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically d/2.
متن کاملDistance-regular Cayley graphs on dihedral groups
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.041